Fast Computation of Significance Threshold in QTL Mapping of Dynamic Quantitative Traits
نویسندگان
چکیده
منابع مشابه
Quantitative trait loci mapping of panicle traits in rice
In this study 90 individuals of recombinant inbred lines (RILs) were developed by crossing subspecies of japonica rice cultivar, ‘Nagdong’ and an indica type cultivar, ‘Cheongcheong’. These individuals were used to identify the quantitative trait loci of panicle traits using SSR markers. A genetic linkage map was constructed using one hundred fifty four simple sequence repeat ...
متن کاملQuantitative trait loci mapping of panicle traits in rice
In this study 90 individuals of recombinant inbred lines (RILs) were developed by crossing subspecies of japonica rice cultivar, ‘Nagdong’ and an indica type cultivar, ‘Cheongcheong’. These individuals were used to identify the quantitative trait loci of panicle traits using SSR markers. A genetic linkage map was constructed using one hundred fifty four simple sequence repeat ...
متن کاملMulti-QTL Mapping for Quantitative Traits Using Epistatic Distorted Markers
The interaction between segregation distortion loci (SDL) has been often observed in all kinds of mapping populations. However, little has been known about the effect of epistatic SDL on quantitative trait locus (QTL) mapping. Here we proposed a multi-QTL mapping approach using epistatic distorted markers. Using the corrected linkage groups, epistatic SDL was identified. Then, these SDL paramet...
متن کاملQuantitative traits in plants: beyond the QTL.
Phenotypic variation for quantitative traits results from segregation at multiple quantitative trait loci (QTL), the effects of which are modified by the internal and external environments. Because of their favorable genetic attributes (e.g. short generation time, large families and tolerance to inbreeding), plants are often used to test new concepts in quantitative trait analysis. Thus far, th...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Biometrics & Biostatistics
سال: 2017
ISSN: 2155-6180
DOI: 10.4172/2155-6180.1000329